Refinement Tree Based Partitioning for Adaptive Grids
نویسنده
چکیده
We present a new partitioning algorithm for grids obtained by adaptive reenement. The method uses the adaptive reenement tree to obtain information unavailable to other partitioning methods which use only the nal grid and/or some geometric data. The algorithm requires (typically) O(log(N)) operations after an O(N) preprocessing step. The method is guaranteed to produce perfectly balanced connected partitions. Numerical examples indicate that the partitions have only about 10% more crossings than methods that require many times the execution time, and unlike other methods, there is reason to expect similarity of the partitions of nested grids.
منابع مشابه
A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کاملFast Volume Rendering of Sparse Datasets Using Adaptive Mesh Refinement
In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and th...
متن کاملForestClaw: A parallel algorithm for patch-based adaptive mesh refinement on a forest of quadtrees
We describe a parallel, adaptive, multiblock algorithm for explicit integration of time dependent partial differential equations on two-dimensional Cartesian grids. The grid layout we consider consists of a nested hierarchy of fixed size, non-overlapping, logically Cartesian grids stored as leaves in a quadtree. Dynamic grid refinement and parallel partitioning of the grids is done through the ...
متن کاملThe Refinement-Tree Partition for Parallel Solution of Partial Differential Equations
Dynamic load balancing is considered in the context of adaptive multilevel methods for partial differential equations on distributed memory multiprocessors. An approach that periodically repartitions the grid is taken. The important properties of a partitioning algorithm are presented and discussed in this context. A partitioning algorithm based on the refinement tree of the adaptive grid is pr...
متن کامل